A tabu search-based algorithm for the fuzzy clustering problem
نویسندگان
چکیده
The Fuzzy Clustering Problem (FCP) is a mathematical program which is difficult to solve since it is nonconvex, which implies possession of many local minima. The fuzzy C-means heuristic is the widely known approach to this problem, but it is guaranteed only to yield local minima. In this paper, we propose a new approach to this problem which is based on tabu search technique, and aims at finding a global solution of FCP. We compare the performance of the algorithm with the fuzzy Cmeans algorithm. (C) 1997 Pattern Recognition Society. Published by Elsevier Science Ltd.
منابع مشابه
Tabu-KM: A Hybrid Clustering Algorithm Based on Tabu Search Approach
The clustering problem under the criterion of minimum sum of squares is a non-convex and non-linear program, which possesses many locally optimal values, resulting that its solution often falls into these trap and therefore cannot converge to global optima solution. In this paper, an efficient hybrid optimization algorithm is developed for solving this problem, called Tabu-KM. It gathers the ...
متن کاملAPPLICATION OF TABU SEARCH FOR SOLVING THE BI-OBJECTIVE WAREHOUSE PROBLEM IN A FUZZY ENVIRONMENT
The bi-objective warehouse problem in a crisp environment is often not eective in dealing with the imprecision or vagueness in the values of the problem parameters. To deal with such situations, several researchers have proposed that the parameters be represented as fuzzy numbers. We describe a new algorithm for fuzzy bi-objective warehouse problem using a ranking function followed by an applic...
متن کاملA Tabu Search Approach To The Fuzzy Clustering Problem *
In this paper we consider the fuzzy clustering problem. This is a nonconvex problem that has many local minima. It has been studied by many researchers and the most well-known method is the fuzzy c-means algorithm. We develop a new algorithm for solving this problem based on a tabu search technique. Preliminary computational experience on the developed algorithm are encouraging and compare favo...
متن کاملA Tabu Search Method for a New Bi-Objective Open Shop Scheduling Problem by a Fuzzy Multi-Objective Decision Making Approach (RESEARCH NOTE)
This paper proposes a novel, bi-objective mixed-integer mathematical programming for an open shop scheduling problem (OSSP) that minimizes the mean tardiness and the mean completion time. To obtain the efficient (Pareto-optimal) solutions, a fuzzy multi-objective decision making (fuzzy MODM) approach is applied. By the use of this approach, the related auxiliary single objective formulation can...
متن کاملA heuristic approach for multi-stage sequence-dependent group scheduling problems
We present several heuristic algorithms based on tabu search for solving the multi-stage sequence-dependent group scheduling (SDGS) problem by considering minimization of makespan as the criterion. As the problem is recognized to be strongly NP-hard, several meta (tabu) search-based solution algorithms are developed to efficiently solve industry-size problem instances. Also, two different initi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Pattern Recognition
دوره 30 شماره
صفحات -
تاریخ انتشار 1997